A STEERABLE LEAST SQUARE APPROACH FOR PATTERN SYNTHESIS
نویسندگان
چکیده
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کامل2D Path Following for Marine Craft: A Least-Square Approach
We study the problem of straight-line path following for fully actuated marine craft. We propose a controller that adjusts the speed of the marine craft according to the geometric distance and the rate of convergence to the path. The control law is derived using the method of least squares, which is used to find an approximate solution for overdetermined systems. The conditions under which the ...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملa projected alternating least square approach for computation of nonnegative matrix factorization
nonnegative matrix factorization (nmf) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. methods in alternating least square (als) approach usually used to solve this non-convex minimization problem. at each step of als algorithms two convex least square problems should be solved, which causes high com...
متن کاملNonlinear least-square solution to flat-top pattern synthesis using arbitrary linear array
This paper presents a new approach for synthesizing flat-top patterns, based on the least-square error criterion. The cost function is formulated according to the amplitude approximation error without phase constraint. The optimal array weight is obtained by using the Levenberg–Marquardt nonlinear optimization algorithm. Simulations are performed to compare the proposed approach with the Woodwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress In Electromagnetics Research M
سال: 2017
ISSN: 1937-8726
DOI: 10.2528/pierm17052404